Finitary approximations of coarse structures

نویسندگان

چکیده

A coarse structure $ \mathcal{E}$ on a set $X$ is called finitary if, for each entourage $E\in \mathcal{E}$, there exists natural number $n$ such that E[x]< n $x\in X$. By approximation of \mathcal{E}^\prime$, we mean any \mathcal{E}\subseteq \mathcal{E}^\prime$.If $\mathcal{E}^\prime$ has countable base and $E[x]$ finite X$ then \mathcal{E}^\prime$has cellular the relations linkness subsets $( X,\mathcal{E}^\prime)$ X, \mathcal{E})$ coincide.This answers Question 6 from [8]: class spaces not stable under linkness. We define apply strongest structure.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coarse-Grained Prediction of RNA Loop Structures

One of the key issues in the theoretical prediction of RNA folding is the prediction of loop structure from the sequence. RNA loop free energies are dependent on the loop sequence content. However, most current models account only for the loop length-dependence. The previously developed "Vfold" model (a coarse-grained RNA folding model) provides an effective method to generate the complete ense...

متن کامل

Pair approximations for spatial structures?

This work explores the success of pair approximations in capturing local correlations and the spatial structure of population contact networks, especially in respect of the rate of spread of epidemics. Networks of interest range from the local extreme where interactions are only between nearest neighbours in some low dimensional space, and the infinite-dimensional ’mean-field’ extreme where all...

متن کامل

Upscaling Techniques Based on Subspace Corrections and Coarse-grid Approximations

In this paper we consider new upscaling and homogenization methods for the pressure equation that are less sensitive to the boundary condition assumptions than many other published methods. We start from the discretized pressure equation and rely on the construction of subproblems with signii-cantly fewer unknowns, describing the behaviour of the solution of the ne-grid problem in suitable subs...

متن کامل

Finitary Languages

The class of ω-regular languages provides a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens “eventually”. Finitary liveness was proposed by Alur and Henzinger as a stronger formulation of liveness [AH98]. It requires that there exists an unknown, fixed bound b...

متن کامل

Finitary Coloring

Suppose that the vertices of Z are assigned random colors via a finitary factor of independent identically distributed (iid) vertex-labels. That is, the color of vertex v is determined by a rule that examines the labels within a finite (but random and perhaps unbounded) distance R of v, and the same rule applies at all vertices. We investigate the tail behavior of R if the coloring is required ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Matemati?nì studìï

سال: 2021

ISSN: ['2411-0620', '1027-4634']

DOI: https://doi.org/10.30970/ms.55.1.33-36